Oblivious Algorithms for the Maximum Directed Cut Problem
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Maximum Cut Problem
Consider the problem of keeping closely related objects together and seperating unrelated objects from each other. This idea has clear applications to statistics, computer science, mathematics, social studies, and natural sciences just to name a few. To model this idea, we de ne the maximum cut problem that is simple to state but di cult to solve. The aim of this report is to provide two known ...
متن کاملOnline Maximum Directed Cut
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio of 3 √ 3
متن کاملMaximum Cut Problem, MAX-CUT
The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...
متن کاملSpectral bounds for the maximum cut problem
The maximum cut problem this paper deals with can be formulated as follows. Given an undirected simple graph G = (V,E) where V and E stand for the node and edge sets respectively, and given weights assigned to the edges: (wij)ij∈E , a cut δ(S), with S ⊆ V is de ned as the set of edges in E with exactly one endnode in S, i.e. δ(S) = {ij ∈ E | |S ∩ {i, j}| = 1}. The weight w(S) of the cut δ(S) is...
متن کامل2 Maximum Cut Problem
2.1 Greedy algorithm We can think of the cut as a partition of verticesl C = (S, V \ S) whiere S ⊆ V . We can switch between different cuts by moving vertices across the cut, in to or out of S. Moving v across the cut swaps its cut edges with its non-cut edges. This increase the value of the cut when the total weight of its non-cut edges exceeds the weight of the cut edges. If v ∈ S (and simila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9806-z